An Emergency Evacuation Planning Model Using the Universally Quickest Flow
نویسندگان
چکیده
In recent years, catastrophic disasters by massive earthquakes are increasing in the world, and disaster management is required more than ever. In the case of disasters such as tsunami from which the slight delay of evacuation deprives of life. In this article, we formalize the emergency evacuation planning model for the evacuation from tsunami etc. based on the idea of the universally quickest flow. We will show that there does not always exist a universally quickest flow when the capacity constraint of refuges is taken into account. Therefore, we will propose an alternative criterion that approximates a universally quickest flow, and presents an algorithm for finding an optimal flow for this criterion. Numerical experiments of the evacuation aimed at a local city in Japan are carried out where tsunami damages are assumed to occur when a big earthquake occurs in the ocean nearby.
منابع مشابه
Multimodal Solutions for Large Scale Evacuations Period 5 / 15 / 2008 to 12 / 31 / 2009
DISCLAIMER The contents of this report reflect the views of the authors, who are responsible for the facts and the accuracy of the information presented herein. This document is disseminated under the sponsorship of the Department of Transportation University Transportation Centers Program, in the interest of information exchange. The U.S. Government assumes no liability for the contents or use...
متن کاملTitle of dissertation: DEVELOPMENT OF A MIXED-FLOW OPTIMIZATION SYSTEM FOR EMERGENCY EVACUATION IN URBAN NETWORKS
Title of dissertation: DEVELOPMENT OF A MIXED-FLOW OPTIMIZATION SYSTEM FOR EMERGENCY EVACUATION IN URBAN NETWORKS Xin Zhang, Doctor of Philosophy, 2012 Dissertation directed by: Professor Gang-len Chang Department of Civil & Environmental Engineering In most metropolitan areas, an emergency evacuation may demand a potentially large number of evacuees to use transit systems or to walk over some ...
متن کاملOn Solving Quickest Time Problems in Time-Dependent, Dynamic Networks
In this paper, a pseudopolynomial time algorithm is presented for solving the integral time-dependent quickest flow problem (TDQFP) and its multiple source and sink counterparts: the time-dependent evacuation and quickest transshipment problems. A more widely known, though less general version, is the quickest flow problem (QFP). The QFP has historically been defined on a dynamic network, where...
متن کاملFactors Influencing Failure Emergency Evacuation in Work Environments during Fire
One of the necessary measures of saving human life in emergency situations, such as fires, is the safe and swift evacuation of people. The prerequisites for this are to anticipate, identify, and eliminate factors preventing people from leaving buildings in a timely and safe manner while moving them to a safe place [1]. The occurrence of errors caused by engineering, design, human, and psycholog...
متن کاملMin-Max quickest path problems
In a dynamic network, the quickest path problem asks for a path such that a given amount of flow can be sent from source to sink via this path in minimal time. In practical settings, for example, in evacuation or transportation planning, the problem parameters might not be known exactly a priori. It is therefore of interest to consider robust versions of these problems in which travel times and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Review of Socionetwork Strategies
دوره 6 شماره
صفحات -
تاریخ انتشار 2012